De Bruijn Sequences for the Binary Strings with Maximum Density

نویسندگان

  • Joe Sawada
  • Brett Stevens
  • Aaron Williams
چکیده

A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

De Bruijn Sequences for the Binary Strings with Maximum Specified Density

A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n

متن کامل

Fixed-density De Bruijn Sequences

De Bruijn sequences are circular strings of length 2 whose substrings are the binary strings of length n. Our focus is on de Bruijn sequences for binary strings that have the same density (number of 1s). We construct circular strings of length ( n−1 d )

متن کامل

De Bruijn Sequences for Fixed-Weight Binary Strings

De Bruijn sequences are circular strings of length 2n whose length n substrings are the binary strings of length n. Our focus is on creating circular strings of length (

متن کامل

The Coolest Order of Binary Strings

Pick a binary string of length n and remove its first bit b. Now insert b after the first remaining 10, or insert b at the end if there is no remaining 10. Do it again. And again. Keep going! Eventually, you will cycle through all 2 of the binary strings of length n. For example, are the binary strings of length n = 4, where 1 = and 0 = . Che bello! And if you only want strings with weight (num...

متن کامل

Binary bubble languages and cool-lex order

A bubble language is a set of binary strings with a simple closure property: The first 01 of any string can be replaced by 10 to obtain another string in the set. Natural representations of many combinatorial objects are bubble languages. Examples include binary string representations of k-ary trees, unit interval graphs, linear-extensions of B-posets, binary necklaces and Lyndon words, and fea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011